The Projected TAR and its Application to Conformance Checking

نویسندگان

  • Johannes Prescher
  • Jan Mendling
  • Matthias Weidlich
چکیده

Relational semantics of business process models have seen an uptake in various fields of application. As a prominent example, the Transition Adjacency Relation (TAR) has been used, for instance, to conduct conformance checking and similarity assessment. TAR is defined over the complete set of transitions of a Petri net and induces order dependencies between pairs of them. In this paper, we consider TAR in a more general setting, in which the order dependencies shall be derived only for a subset of projected transitions. We show how to derive this projected variant of TAR from the reachability graph of a reduced Petri net. We elaborate the projected TAR for conformance checking in a case from industry.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Timed Model-Based Conformance Testing A Case Study Using Tron Testing Key States of Automated Trust Anchor Updating (RFC 5011) in Autotrust Bachelor Thesis

We investigate the usability of Timed Model-Based Testing in a case study: Conformance of the implementation Autotrust with Automatic Trust Anchor Updating, a protocol to help securing DNS. We present models for timing aspects of the protocol. Definition of checks on quiescence in the model are proven to be possible. Latency during input application can yield false test results. We present a mo...

متن کامل

Automatic Coding Rule Conformance Checking Using Logic Programming

An extended practise in Software Engineering and programming in industry is the application of coding rules. Coding rules are customarily used to constrain the use (or abuse) of certain constructions in a programming language. However, these rules are usually written using natural language, which is intrinsically ambiguous and which may complicate its use and hinder their automatic application....

متن کامل

Permission to speak: A logic for access control and conformance

Formal languages for policy have been developed for access control and conformance checking. In this paper, we describe a formalism that combines features that have been developed for each application. From access control, we adopt the use of a saying operator. From conformance checking, we adopt the use of operators for obligation and permission. The operators are combined using an axiom that ...

متن کامل

Conformance Checking of Components Against Their Non-deterministic Specifications

Conformance checking of a component is a testing method to see if an implementation and its executable specification are behaviorally equivalent relative to any interactions performed on the implementation. Such checking is complicated by the presence of non-determinism in the specification: the specification may permit a set of possible behaviors. We present a new method to automatically deriv...

متن کامل

Conformance Checking of Real-Time Models - Symbolic Execution vs. Bounded Model Checking

Abstract. We compare conformance checking based on symbolic execution to conformance checking via bounded model checking. The application context is fault-based test case generation, focusing on realtime faults. The existing bounded model checking approach is performed on timed automata. It supports time-relevant mutation operators and a preprocessing functionality for removing silent transitio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012